Resource Allocation for Hardware Implementations of Map
نویسندگان
چکیده
The map operation, in which a function is applied independently to each element in a collection to produce a new collection, appears in many settings and is easy to parallelize. While a straightforward implementation in hardware will consist of multiple functional units with buffers to balance variable execution times, the best trade-off between these two components is not obvious. Too many buffers wastes resources that could otherwise perform computation; too few buffers causes functional units to lie idle waiting for empty buffers. Our work considers this abstract problem, derives worst-case workload distributions, then shows how to trade functional units for buffers to maximize throughput. Our results can be used by designers and compilers alike to produce efficient parallel implementations of map.
منابع مشابه
Some observations on methodology and research objectives in timed systems
Different communities With respect to the topic of the role of time in systems there seem to be several communities. The RealTime community (RTC) is essentially concerned with properties of task sets and resource allocation (reservation) policies. Typical questions circle around topics like maximizing the fraction of task sets that are feasible, utilization bounds for accepting new tasks, impro...
متن کاملDistribution of Health Resource Allocation in the Fars Province Using the Scalogram Analysis Technique in 2011
The importance of health indicators in the recent years has created challenges in resource allocation. Balanced and fair distribution of health resources is one of the main principles in achieving equity. The goal of this cross-sectional descriptive study, conducted in 2010, was to classify health structural indicators in the Fars province using the scalogram technique. Health structural indica...
متن کاملA Technique for Mapping Optimization Solutions into Hardware
Feedback neural architectures have addressed a myriad of optimization problems—almost exclusively in slow software simulation. Speed is promised only when implemented in high-speed recurrent hardware. Unfortunately, hardware’s discrepancies from ideal conspire to produce poor solutions. This paper describes a recurrent hardware-in-the-loop learning procedure that maps idealized solutions of opt...
متن کاملA review of methods for resource allocation and operational framework in cloud computing
The issue of management and allocation of resources in cloud computing environments, according to the breadth of scale and modern technology implementation, is a complicated issue. Issues such as: the heterogeneity of resources, resource dependencies to each other, the dynamics of the environment, virtualization, workload diversity as well as a wide range of management objectives of cloud servi...
متن کاملA New Fairness Index and Novel Approach for QoS-Aware Resource Allocation in LTE Networks Based on Utility Functions
Resource allocation techniques have recently appeared as a widely recognized feature in LTE networks. Most of existing approaches in resource allocation focus on maximizing network’s utility functions. The great potential of utility function in improving resource allocation and enhancing fairness and mean opinion score (MOS) indexes has attracted large efforts over the last few years. In this p...
متن کامل